Combining computational effects: commutativity and sum

نویسندگان

  • Martin Hyland
  • Gordon Plotkin
  • John Power
چکیده

We begin to develop a unified account of modularity for computational effects. We use the notion of enriched Lawvere theory, together with its relationship with strong monads, to reformulate Moggi’s paradigm for modelling computational effects; we emphasise the importance here of the operations that induce computational effects. Effects qua theories are then combined by appropriate bifunctors (on the category of theories). We give a theory of the commutative combination of effects, which in particular yields Moggi’s side-effects monad transformer (an application is the combination of side-effects with nondeterminism). And we give a theory for the sum of computational effects, which in particular yields Moggi’s exceptions monad transformer (an application is the combination of exceptions with other effects).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite groups with three relative commutativity degrees

‎‎For a finite group $G$ and a subgroup $H$ of $G$‎, ‎the relative commutativity degree of $H$ in $G$‎, ‎denoted by $d(H,G)$‎, ‎is the probability that an element of $H$ commutes with an element of $G$‎. ‎Let $mathcal{D}(G)={d(H,G):Hleq G}$ be the set of all relative commutativity degrees of subgroups of $G$‎. ‎It is shown that a finite group $G$ admits three relative commutativity degrees if a...

متن کامل

Graph cycles and diagram commutativity

Bases are exhibited for Kn, Kp,q, and Qd, and it is shown how each cycle of the various graphs can be built as a hierarchical ordered sum in which all of the partial sums are (simple) cycles with each cycle from either the basis or one of the hierarchically constructed cycle-sets meeting the partial sum of its predecessors in a nontrivial path. A property that holds for this “connected sum” of ...

متن کامل

Commutativity degree of $mathbb{Z}_p$≀$mathbb{Z}_{p^n}

For a nite group G the commutativity degree denote by d(G) and dend:$$d(G) =frac{|{(x; y)|x, yin G,xy = yx}|}{|G|^2}.$$ In [2] authors found commutativity degree for some groups,in this paper we nd commutativity degree for a class of groups that have high nilpontencies.

متن کامل

Bi-objective Optimization for Just in Time Scheduling: Application to the Two-Stage Assembly Flow Shop Problem

This paper considers a two-stage assembly flow shop problem (TAFSP) where m machines are in the first stage and an assembly machine is in the second stage. The objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. JIT seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...

متن کامل

In Search of the Roots of Formal Computation

It became clear by the 1930s that steps of formal computation are also steps of formal deduction as defined by recursion equations and other principles of arithmetic. This development began with attempts at giving a foundation to the laws of commutativity and associativity of sum: Followers of Kant's doctrine of the synthetic a priori in arithmetic, a certain Johann Schultz as foremost, missed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001